Using Genetic Algorithm For Winter Maintenance Operations: Multi Depot K-Chinese Postman Problem
نویسندگان
چکیده
منابع مشابه
Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملParameterized complexity of k-Chinese Postman Problem
We consider the following problem called the k-Chinese Postman Problem (k-CPP): given a connected edge-weighted graph G and integers p and k, decide whether there are at least k closed walks such that every edge of G is contained in at least one of them and the total weight of the edges in the walks is at most p? The problem k-CPP is NP-complete, and van Bevern et al. (to appear) and Sorge (201...
متن کاملOn games arising from multi-depot Chinese postman problems
This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a non-negative weight function on the edges of G. A solution to the MDCP is a minimum weight tour of the (di)graph...
متن کاملAn algorithm for the hierarchical Chinese postman problem
The Hierarchical Chinese Postman Problem (HCPP) is a variant of the classical Chinese Postman Problem, in which the arcs are partitioned into clusters and a precedence relation is de ned on clusters. Practical applications of the HCPP include snow and ice control on the roads and determination of optimal torch paths in ame cutting. The HCPP is NP-hard in general, but polynomial-time solvable if...
متن کاملA Genetic Algorithm for the Undirected Rural Postman Problem
This paper introduces a new method to deal with the Undirected Rural Postman Problem (RPP), based on Genetic Algorithms. The RPP is a particular Arc Routing Problem which consists of determining a minimum cost circuit on a graph so that it is possible to traverse a given subset of required edges. The RPP is known to be an NP-hard problem and it has some interesting real-life applications. The a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EMAJ: Emerging Markets Journal
سال: 2015
ISSN: 2158-8708,2159-242X
DOI: 10.5195/emaj.2015.69